On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity

نویسندگان

  • Szabolcs Iván
  • Judit Nagy-György
چکیده

We give an upper bound of n((n−1)!−(n−3)!) for the possi5 ble largest size of a subsemigroup of the full transformational semigroup 6 over n elements consisting only of nonpermutational transformations. As 7 an application we gain the same upper bound for the syntactic complex8 ity of (generalized) definite languages as well. 9

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

UNIVERSAL COMPACTIFICATIONS OF TRANSFORMATION SEMIGROUPS

We extend the notion of semigroup compactification to the class of transformation semigroups, and determine the compactifications which are universal with respect to some topological properties.

متن کامل

Different Task Complexity Factors and Cognitive Individual ‎Differences: The Effects on EFL Writers’ Performance

This study aimed at examining the main and interaction effects of increased intentional reasoning demands, planning time, and also language learning aptitude on syntactic complexity, accuracy, lexical complexity, and fluency (CALF) of 226 EFL learners’ performance on letter writing tasks. The participants were first randomly assigned to three experimental groups to be given a task with differin...

متن کامل

The Relationship between Syntactic and Lexical Complexity in Speech Monologues of EFL Learners

: This study aims to explore the relationship between syntactic and lexical complexity and also the relationship between different aspects of lexical complexity. To this end, speech monologs of 35 Iranian high-intermediate learners of English on three different tasks (i.e. argumentation, description, and narration) were analyzed for correlations between one measure of sy...

متن کامل

Large Aperiodic Semigroups

The syntactic complexity of a regular language is the size of its syntactic semigroup. This semigroup is isomorphic to the transition semigroup of the minimal deterministic finite automaton accepting the language, that is, to the semigroup generated by transformations induced by non-empty words on the set of states of the automaton. In this paper we search for the largest syntactic semigroup of...

متن کامل

The Effect of Reducing Lexical and Syntactic Complexity of Texts on Reading Comprehension

The present study investigated the effect of different types of text simplification (i.e., reducing the lexical and syntactic complexity of texts) on reading comprehension of English as a Foreign Language learners (EFL). Sixty female intermediate EFL learners from three intact classes in Tabarestan Language Institute in Tehran participated in the study. The intact classes were assigned to three...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Acta Cybern.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2016